Modeling long correlation times using additive binary Markov chains: Applications to wind generation time series
نویسندگان
چکیده
منابع مشابه
Adiabatic times for Markov chains and applications
We state and prove a generalized adiabatic theorem for Markov chains and provide examples and applications related to Glauber dynamics of the Ising model over Zd/nZd. The theorems derived in this paper describe a type of adiabatic dynamics for `(R+) norm preserving, time inhomogeneous Markov transformations, while quantum adiabatic theorems deal with `2(Cn) norm preserving ones, i.e. gradually ...
متن کاملMixing Times with Applications to Perturbed Markov Chains
A measure of the “mixing time” or “time to stationarity” in a finite irreducible discrete time Markov chain is considered. The statistic η π i ij j m j m = = ∑ 1 , where {πj} is the stationary distribution and mij is the mean first passage time from state i to state j of the Markov chain, is shown to be independent of the state i that the chain starts in (so that ηi = η for all i), is minimal i...
متن کاملMemory Function versus Binary Correlator in Additive Markov Chains
We study properties of the additive binary Markov chain with short and longrange correlations. A new approach is suggested that allows one to express global statistical properties of a binary chain in terms of the so-called memory function. The latter is directly connected with the pair correlator of a chain via the integral equation that is analyzed in great detail. To elucidate the relation b...
متن کاملMerge Times and Hitting Times of Time-inhomogeneous Markov Chains
The purpose of this thesis is to study the long term behavior of time-inhomogeneous Markov chains. We analyze under what conditions they converge, in what sense they converge and what the rate of convergence should be. A Markov chain is a random process with the memoryless property: the next state only depends on the current state, and not on the sequence of events that preceded it. Time-inhomo...
متن کاملAdditive Functionals for Discrete-time Markov Chains with Applications to Birth–death Processes
In this paper we are interested in bounding or calculating the additive functionals of the first return time on a set for discrete-time Markov chains on a countable state space, which is motivated by investigating ergodic theory and central limit theorems. To do so, we introduce the theory of the minimal nonnegative solution. This theory combined with some other techniques is proved useful for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2018
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.97.032138